Computing the Characteristic Polynomial of Threshold Graphs
نویسندگان
چکیده
منابع مشابه
Computing the Characteristic Polynomial of Threshold Graphs
We present an algorithm for constructing the characteristic polynomial of a threshold graph’s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It can be implemented using O(n) space and with running time O(n). Submitted: December 2013 Reviewed: October 2014 Revised: November 2014 Accepted: December 2014 Final: December 2014 Published: December 20...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملChordal graphs and the characteristic polynomial
A characteristic polynomial was recently de!ned for greedoids, generalizing the notion for matroids. When chordal graphs are viewed as antimatroids by shelling of simplicial vertices, the greedoid characteristic polynomial gives additional information about those graphs. In particular, the characteristic polynomial for a chordal graph is an alternating clique generating function and is expressi...
متن کاملEfficient Computation of the Characteristic Polynomial of a Threshold Graph
Abstract. An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chvátal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a one vertex graph by repeatedly adding either an isolated vertex or a dominating vertex, which is a vertex adjacent to all the other vertices. Thresh...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2014
ISSN: 1526-1719
DOI: 10.7155/jgaa.00342